1 Overview • This talk is about: – The Boolean Satisfiability Problem (SAT) – The Constraint Satisfaction Problem (CSP)

Source URL: algo2017.ac.tuwien.ac.at

Logic, Computation and Constraint Satisfaction Barnaby D. Martin University of Leicester

Source URL: www.bedewell.com

• Computational complexity theory
• Logic
• Complexity classes
• Mathematical logic
• PSPACE
• FO
• Second-order logic
• P versus NP problem
• Constraint satisfaction problem
• NP
• P
• Constraint satisfaction

On Solving Boolean Multilevel Optimization Problems∗ Josep Argelich INESC-ID Lisbon

Source URL: www.mancoosi.org

• Theoretical computer science
• Mathematics
• Computational complexity theory
• Operations research
• Logic in computer science
• Mathematical optimization
• NP-complete problems
• Boolean algebra
• Maximum satisfiability problem
• Boolean satisfiability problem
• Constraint satisfaction
• Solver

CONTRIBUTED TALK ABSTRACTS 1.2 JAKUB BUL´IN Charles University in Prague Absorption in finitely related SD(∧) algebras has bounded arity The notion of absorbing subuniverse plays an important role in the recent devel

Source URL: www.fields.utoronto.ca

• Logic
• Constraint programming
• Constraint satisfaction problem
• Model theory
• Abstraction
• Philosophy
• Constraint satisfaction
• Satisfiability
• Algebraic structure

Second International Conference on Multiagent SystemsDistributed Breakout Algorithm for Solving Distributed Constraint Satisfaction Problems Makoto Yokoo

Source URL: agent.inf.kyushu-u.ac.jp

• Constraint programming
• Mathematics
• Constraint satisfaction problem
• Constraint satisfaction
• Algorithm
• Shortest path problem
• Theoretical computer science
• Min-conflicts algorithm
• Distributed constraint optimization

Revisiting ADOPT-ing and its Feedback Schemes Marius C. Silaghi Florida Institute of Technology Makoto Yokoo Kyushu University

Source URL: agent.inf.kyushu-u.ac.jp

• Constraint programming
• Distributed constraint optimization
• Weighted constraint satisfaction problem
• Constraint satisfaction problem

Programming with Enumerators: Constructive Approach to Challenge the Status Quo in Automated Data Structure Generation Ivan Kuraj CSAIL, MIT, USA

Source URL: tinytocs.ece.utexas.edu

• Software engineering
• Computer programming
• Constraint programming
• Enumerated type
• Type theory
• Constraint satisfaction problem
• Generator
• Backtracking
• Data structure

Generating tractable CSPs by means of adjoint functors Jan Foniok joint work with Claude Tardif Fête of Combinatorics and Computer Science

Source URL: www.ifor.math.ethz.ch

• Graph theory
• Mathematics
• Constraint programming
• Discrete mathematics
• Morphisms
• Constraint satisfaction problem
• Graph homomorphism
• Constraint satisfaction
• Complexity of constraint satisfaction
• Graph minor

A SAT-based Method for Solving the Two-dimensional Strip Packing Problem Takehide Soh1 , Katsumi Inoue12 , Naoyuki Tamura3 , Mutsunori Banbara3 , and Hidetomo Nabeshima4 1

Source URL: ceur-ws.org

• Theoretical computer science
• Computational complexity theory
• Mathematics
• Constraint programming
• Numerical software
• Automated theorem proving
• DPLL algorithm
• Packing problems
• Solver
• Constraint satisfaction
• Reduction
• Algorithm

University of the Aegean Department of Information and Communication Systems Engineering Artificial Intelligence Laboratory Adaptive Strategies for Solving Constraint Satisfaction Problems

Source URL: www.icsd.aegean.gr

• Constraint programming
• Operations research
• Software engineering
• Constraint satisfaction problem
• Computer programming
• Local consistency
• Search algorithms
• Constraint satisfaction
• Mathematical optimization
• Backtracking